Approximate Relational Hoare Logic for Continuous Random Samplings
نویسندگان
چکیده
منابع مشابه
Approximate Relational Hoare Logic for Continuous Random Samplings
Approximate relational Hoare logic (apRHL) is a logic for formal verification of the differential privacy of databases written in the programming language pWHILE. Strictly speaking, however, this logic deals only with discrete random samplings. In this paper, we define the graded relational lifting of the subprobabilistic variant of Giry monad, which described differential privacy. We extend th...
متن کاملQuantum Relational Hoare Logic
We present a logic for reasoning about pairs of interactive quantum programs – quantum relational Hoare logic (qRHL). This logic follows the spirit of probabilistic relational Hoare logic (Barthe et al. 2009) and allows us to formulate how the outputs of two quantum programs relate given the relationship of their inputs. Probabilistic RHL was used extensively for computer-verified security proo...
متن کاملHoare Logic for Parallel Programs
In the following theories a formalization of the Owicki-Gries and the relyguarantee methods is presented. These methods are widely used for correctness proofs of parallel imperative programs with shared variables. We define syntax, semantics and proof rules in Isabelle/HOL. The proof rules also provide for programs parameterized in the number of parallel components. Their correctness w.r.t. the...
متن کاملHoare logic for multistaged programs
In this work we present a straight forward extension of Hoare logic that caters for multistaged programs. We have chosen a minimalist support language which allowed us to focus on the issues pertaining to the staged features. Similarly, the support logic is a simple, staged, first order logic with equality assertions. We allow the equality assertions to contain descriptions of staged code in th...
متن کاملHoare Logic for Graph Programs
We present a new approach for verifying programs written in GP (for Graph Programs), an experimental programming language for performing computations on graphs at a high level of abstraction. Taking a labelled graph as input, a graph program nondeterministically applies to it a number of graph transformation rules, directed by simple control constructs such as sequential composition and as-long...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2016
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2016.09.043